Decidability and Complexity via Mosaics of the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders
Identifieur interne : 001606 ( Main/Exploration ); précédent : 001605; suivant : 001607Decidability and Complexity via Mosaics of the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders
Auteurs : Philippe Balbiani [France] ; Szabolcs Mikulás [Royaume-Uni]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: This article considers the temporal logic of the lexicographic products of unbounded dense linear orders and provides via mosaics a complete decision procedure in nondeterministic polynomial time for the satisfiability problem it gives rise to.
Url:
DOI: 10.1007/978-3-642-40885-4_10
Affiliations:
- France, Royaume-Uni
- Angleterre, Grand Londres, Midi-Pyrénées, Occitanie (région administrative)
- Londres, Toulouse
- Université de Londres
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000C87
- to stream Istex, to step Curation: 000C79
- to stream Istex, to step Checkpoint: 000232
- to stream Main, to step Merge: 001618
- to stream Main, to step Curation: 001606
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Decidability and Complexity via Mosaics of the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders</title><author><name sortKey="Balbiani, Philippe" sort="Balbiani, Philippe" uniqKey="Balbiani P" first="Philippe" last="Balbiani">Philippe Balbiani</name></author><author><name sortKey="Mikulas, Szabolcs" sort="Mikulas, Szabolcs" uniqKey="Mikulas S" first="Szabolcs" last="Mikulás">Szabolcs Mikulás</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:36B1EB34A0A6EFE11440D9E1F37EA8F9514AACA8</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-40885-4_10</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-ZL8X868V-X/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000C87</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000C87</idno><idno type="wicri:Area/Istex/Curation">000C79</idno><idno type="wicri:Area/Istex/Checkpoint">000232</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000232</idno><idno type="wicri:doubleKey">0302-9743:2013:Balbiani P:decidability:and:complexity</idno><idno type="wicri:Area/Main/Merge">001618</idno><idno type="wicri:Area/Main/Curation">001606</idno><idno type="wicri:Area/Main/Exploration">001606</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Decidability and Complexity via Mosaics of the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders</title><author><name sortKey="Balbiani, Philippe" sort="Balbiani, Philippe" uniqKey="Balbiani P" first="Philippe" last="Balbiani">Philippe Balbiani</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>Institut de recherche en informatique de Toulouse, CNRS — University of Toulouse, 118 Route de Narbonne, 31062, Toulouse Cedex 9</wicri:regionArea><placeName><region type="region" nuts="2">Occitanie (région administrative)</region><region type="old region" nuts="2">Midi-Pyrénées</region><settlement type="city">Toulouse</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Mikulas, Szabolcs" sort="Mikulas, Szabolcs" uniqKey="Mikulas S" first="Szabolcs" last="Mikulás">Szabolcs Mikulás</name><affiliation wicri:level="4"><country xml:lang="fr">Royaume-Uni</country><wicri:regionArea>Department of Computer Science and Information Systems, Birbeck — University of London, Malet Street, WC1E 7HX, London</wicri:regionArea><placeName><settlement type="city">Londres</settlement><region type="country">Angleterre</region><region type="région" nuts="1">Grand Londres</region></placeName><orgName type="university">Université de Londres</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Royaume-Uni</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This article considers the temporal logic of the lexicographic products of unbounded dense linear orders and provides via mosaics a complete decision procedure in nondeterministic polynomial time for the satisfiability problem it gives rise to.</div></front></TEI><affiliations><list><country><li>France</li><li>Royaume-Uni</li></country><region><li>Angleterre</li><li>Grand Londres</li><li>Midi-Pyrénées</li><li>Occitanie (région administrative)</li></region><settlement><li>Londres</li><li>Toulouse</li></settlement><orgName><li>Université de Londres</li></orgName></list><tree><country name="France"><region name="Occitanie (région administrative)"><name sortKey="Balbiani, Philippe" sort="Balbiani, Philippe" uniqKey="Balbiani P" first="Philippe" last="Balbiani">Philippe Balbiani</name></region><name sortKey="Balbiani, Philippe" sort="Balbiani, Philippe" uniqKey="Balbiani P" first="Philippe" last="Balbiani">Philippe Balbiani</name></country><country name="Royaume-Uni"><region name="Angleterre"><name sortKey="Mikulas, Szabolcs" sort="Mikulas, Szabolcs" uniqKey="Mikulas S" first="Szabolcs" last="Mikulás">Szabolcs Mikulás</name></region><name sortKey="Mikulas, Szabolcs" sort="Mikulas, Szabolcs" uniqKey="Mikulas S" first="Szabolcs" last="Mikulás">Szabolcs Mikulás</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001606 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001606 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:36B1EB34A0A6EFE11440D9E1F37EA8F9514AACA8
|texte= Decidability and Complexity via Mosaics of the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders
}}
| This area was generated with Dilib version V0.6.33. |  |